Rigid Divisibility Sequences Generated by Polynomial Iteration
نویسندگان
چکیده
The goal of this thesis is to explore the properties of a certain class of sequences, rigid divisibility sequences, generated by the iteration of certain polynomials whose coefficients are algebraic integers. The main goal is to provide, as far as is possible, a classification and description of those polynomials which generate rigid divisibility sequences.
منابع مشابه
Primitive Prime Divisors in Polynomial Arithmetic Dynamics
The question of which terms of a recurrence sequence fail to have primitive prime divisors has been significantly studied for several classes of linear recurrence sequences and for elliptic divisibility sequences. In this paper, we consider the question for sequences generated by the iteration of a polynomial. For two classes of polynomials f(x) ∈ Z[x] and initial values a1 ∈ Z, we show that th...
متن کاملPrimitive Prime Divisors of First-Order Polynomial Recurrence Sequences
The question of which terms of a recurrence sequence fail to have primitive prime divisors has been significantly studied for several classes of linear recurrence sequences and for elliptic divisibility sequences. In this paper, we consider the question for sequences generated by the iteration of a polynomial. For two classes of polynomials f(x) ∈ Z[x] and initial values a1 ∈ Z, we show that th...
متن کاملIndex divisibility in dynamical sequences and cyclic orbits modulo p
Let φ(x) = x + c be an integral polynomial of degree at least 2, and consider the sequence (φ(0))n=0, which is the orbit of 0 under iteration by φ. Let Dd,c denote the set of positive integers n for which n | φ(0). We give a characterization of Dd,c in terms of a directed graph and describe a number of its properties, including its cardinality and the primes contained therein. In particular, we...
متن کاملAlgebraic Divisibility Sequences over Function Fields
In this note we study the existence of primes and of primitive divisors in function field analogues of classical divisibility sequences. Under various hypotheses, we prove that Lucas sequences and elliptic divisibility sequences over function fields defined over number fields contain infinitely many irreducible elements. We also prove that an elliptic divisibility sequence over a function field...
متن کاملThe uniform distribution of sequences generated by iterated polynomials
Assume that m, s ∈ N, m > 1, while f is a polynomial with integer coefficients, deg f > 1, f (i) is the ith iteration of the polynomial f , κn has a discrete uniform distribution on the set {0, 1, . . . ,m n − 1}. We are going to prove that with n tending to infinity random vectors
متن کامل